package mydsl;


/**
 * An implementation of the ExpressionTree as described
 * in Goodrich and Tamassia, pp 298ff. This subclass of LinkedBinaryTree
 * contains the buildExpression() method, which builds an expression
 * tree from a fully parenthesized arithmetic expression  using a Stack 
 * to store partial binary trees during the build.  
 * 
 * A StringTokenizer is used to break the expression into its individual
 *  tokens, which consist of numbers, letters, operators (+,-,*,/) and
 *  left and right parentheses. 
 *
 * @author R.Morelli
 */
public class BinaryExpressionTree<E> {

}
